A fast recursive orthogonalization scheme for the Macaulay matrix
نویسندگان
چکیده
منابع مشابه
A fast recursive orthogonalization scheme for the Macaulay matrix
In this article we present a fast recursive orthogonalization scheme for two important subspaces of the Macaulay matrix: its row space and null space. It requires a graded monomial ordering and exploits the resulting structure of the Macaulay matrix induced by this graded ordering. The resulting orthogonal basis for the row space will retain a similar structure as the Macaulay matrix and is as ...
متن کاملRecursive Array Layouts and Fast Matrix Multiplication
The performance of both serial and parallel implementations of matrix multiplication is highly sensitive to memory system behavior. False sharing and cache con icts cause traditional columnmajor or row-major array layouts to incur high variability in memory system performance as matrix size varies. This paper investigates the use of recursive array layouts to improve performance and reduce vari...
متن کاملFast recursive matrix multiplication for multi-core architectures
In this article, we present a fast algorithm for matrix multiplication optimized for recent multicore architectures. The implementation exploits different methodologies from parallel programming, like recursive decomposition, efficient low-level implementations of basic blocks, software prefetching, and task scheduling resulting in a multilevel algorithm with adaptive features. Measurements on ...
متن کاملA Setting for Generalized Orthogonalization
Let H be a complex Hilbert space. We study the geometry of the space of pairs (A,E), for A a (semidefinite bounded linear) positive operator on H and E a (bounded linear) projection on H such that AE = E∗A. Departamento de Matemática, Facultad de Ingenieŕıa,UBA, Buenos Aires(C1063ACV), Argentina; Instituto Argentino de Matemática CONICET, Saavedra 15, Buenos Aires (1083), Argentina. E-mail addr...
متن کاملRecursive Algorithms for the Matrix Padé Problem
Abstract. A matrix triangularization interpretation is given for the recursive algorithms computing the Padé approximants along a certain path in the Padé table, which makes it possible to unify all known algorithms in this field [5], [6]. For the normal Padé table, all these results carry over to the matrix Padé problem in a straightforward way. Additional features, resulting from the noncommu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2014
ISSN: 0377-0427
DOI: 10.1016/j.cam.2014.01.035